Enhancing Clustering Methods by Inserting Relational Information
نویسندگان
چکیده
We consider the problem of clustering elements that have both content and relational information (e.g. Web-pages, scientific papers, etc.). Standard clustering methods use content information only, while graph clustering methods are usually based on the graph structure. Relatively recently, researchers have proposed to combine both types of information. In this paper we propose a simple, yet hitherto unexplored, method to insert the relational information into standard clustering methods.
منابع مشابه
Open Problems in Relational Data Clustering
Data clustering is the task of detecting patterns in a set of data. Most algorithms take non-relational data as input and are sometimes unable to find significant patterns. Many data sets can include relational information, as well as independent object attributes. We believe that clustering with relational data will help find significant patterns where non-relational algorithms fail. This pape...
متن کاملAdaptive Concept Learning through Clustering and Aggregation of Relational Data
We introduce a new approach for Clustering and Aggregating Relational Data (CARD). We assume that data is available in a relational form, where we only have information about the degrees to which pairs of objects in the data set are related. Moreover, we assume that the relational information is represented by multiple dissimilarity matrices. These matrices could have been generated using diffe...
متن کاملA Hybrid Grey based Two Steps Clustering and Firefly Algorithm for Portfolio Selection
Considering the concept of clustering, the main idea of the present study is based on the fact that all stocks for choosing and ranking will not be necessarily in one cluster. Taking the mentioned point into account, this study aims at offering a new methodology for making decisions concerning the formation of a portfolio of stocks in the stock market. To meet this end, Multiple-Criteria Decisi...
متن کاملResearch on Multi-relational Clustering Problems Based on Proper-link
A relational database contains a wealth of information, and multi-relational clustering can be obtained by adopting proper-link. The similarities between prospers and linked calculation target topples can be worked out through searching for relevant multi-relational prospers and links of user clustering target, then the clustering can be completed by selecting CLARANS. In order to promote the e...
متن کاملEnhancing Image and Video Retrieval: Learning via Equivalence Constraint
This paper is about learning using partial information in the form of equivalence constraints. Equivalence constraints provide relational information about the labels of data points, rather than the labels themselves. Our work is motivated by the observation that in many real life applications partial information about the data can be obtained with very little cost. For example, in video indexi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009